TSTP Solution File: NUM682^1 by Satallax---3.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Satallax---3.5
% Problem : NUM682^1 : TPTP v8.1.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Mon Jul 18 13:55:08 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Proof 0.20s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
thf(ty_nat,type,
nat: $tType ).
thf(ty_z,type,
z: nat ).
thf(ty_pl,type,
pl: nat > nat > nat ).
thf(ty_y,type,
y: nat ).
thf(ty_less,type,
less: nat > nat > $o ).
thf(ty_more,type,
more: nat > nat > $o ).
thf(ty_x,type,
x: nat ).
thf(sP1,plain,
( sP1
<=> ! [X1: nat,X2: nat] :
( ( X1 != X2 )
=> ( ~ ( more @ X1 @ X2 )
=> ( less @ X1 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP1])]) ).
thf(sP2,plain,
( sP2
<=> ( less @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) ),
introduced(definition,[new_symbols(definition,[sP2])]) ).
thf(sP3,plain,
( sP3
<=> ( ~ ( more @ x @ y )
=> ( less @ x @ y ) ) ),
introduced(definition,[new_symbols(definition,[sP3])]) ).
thf(sP4,plain,
( sP4
<=> ( ( pl @ y @ z )
= ( pl @ x @ z ) ) ),
introduced(definition,[new_symbols(definition,[sP4])]) ).
thf(sP5,plain,
( sP5
<=> ! [X1: nat,X2: nat] :
~ ( ( ( X1 = X2 )
=> ~ ( more @ X1 @ X2 ) )
=> ( ( ( more @ X1 @ X2 )
=> ~ ( less @ X1 @ X2 ) )
=> ~ ( ( less @ X1 @ X2 )
=> ( X1 != X2 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP5])]) ).
thf(sP6,plain,
( sP6
<=> ( ( ( more @ ( pl @ x @ z ) @ ( pl @ x @ z ) )
=> ~ ( less @ ( pl @ x @ z ) @ ( pl @ x @ z ) ) )
=> ~ ( ( less @ ( pl @ x @ z ) @ ( pl @ x @ z ) )
=> ( ( pl @ x @ z )
!= ( pl @ x @ z ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP6])]) ).
thf(sP7,plain,
( sP7
<=> ! [X1: nat,X2: nat] :
( ( x = X1 )
=> ( ( pl @ x @ X2 )
= ( pl @ X1 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP7])]) ).
thf(sP8,plain,
( sP8
<=> ! [X1: nat,X2: nat] :
( ( more @ x @ X1 )
=> ( more @ ( pl @ x @ X2 ) @ ( pl @ X1 @ X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP8])]) ).
thf(sP9,plain,
( sP9
<=> ( ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) )
=> ~ sP2 ) ),
introduced(definition,[new_symbols(definition,[sP9])]) ).
thf(sP10,plain,
( sP10
<=> ( ( ( pl @ x @ z )
= ( pl @ y @ z ) )
=> sP4 ) ),
introduced(definition,[new_symbols(definition,[sP10])]) ).
thf(sP11,plain,
( sP11
<=> ( ( ( ( pl @ x @ z )
= ( pl @ y @ z ) )
=> ~ ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) )
=> ( sP9
=> ~ ( sP2
=> ( ( pl @ x @ z )
!= ( pl @ y @ z ) ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP11])]) ).
thf(sP12,plain,
( sP12
<=> ( more @ ( pl @ x @ z ) @ ( pl @ y @ z ) ) ),
introduced(definition,[new_symbols(definition,[sP12])]) ).
thf(sP13,plain,
( sP13
<=> ( sP9
=> ~ ( sP2
=> ( ( pl @ x @ z )
!= ( pl @ y @ z ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP13])]) ).
thf(sP14,plain,
( sP14
<=> ! [X1: nat] :
~ ( ( ( ( pl @ x @ z )
= X1 )
=> ~ ( more @ ( pl @ x @ z ) @ X1 ) )
=> ( ( ( more @ ( pl @ x @ z ) @ X1 )
=> ~ ( less @ ( pl @ x @ z ) @ X1 ) )
=> ~ ( ( less @ ( pl @ x @ z ) @ X1 )
=> ( ( pl @ x @ z )
!= X1 ) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP14])]) ).
thf(sP15,plain,
( sP15
<=> ( x = y ) ),
introduced(definition,[new_symbols(definition,[sP15])]) ).
thf(sP16,plain,
( sP16
<=> ! [X1: nat] :
( ( more @ x @ y )
=> ( more @ ( pl @ x @ X1 ) @ ( pl @ y @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP16])]) ).
thf(sP17,plain,
( sP17
<=> ( ~ sP15
=> sP3 ) ),
introduced(definition,[new_symbols(definition,[sP17])]) ).
thf(sP18,plain,
( sP18
<=> ! [X1: nat,X2: nat,X3: nat] :
( ( X1 = X2 )
=> ( ( pl @ X1 @ X3 )
= ( pl @ X2 @ X3 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP18])]) ).
thf(sP19,plain,
( sP19
<=> ( less @ x @ y ) ),
introduced(definition,[new_symbols(definition,[sP19])]) ).
thf(sP20,plain,
( sP20
<=> ( ( more @ x @ y )
=> sP12 ) ),
introduced(definition,[new_symbols(definition,[sP20])]) ).
thf(sP21,plain,
( sP21
<=> ( more @ x @ y ) ),
introduced(definition,[new_symbols(definition,[sP21])]) ).
thf(sP22,plain,
( sP22
<=> ! [X1: nat] :
( ( x != X1 )
=> ( ~ ( more @ x @ X1 )
=> ( less @ x @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP22])]) ).
thf(sP23,plain,
( sP23
<=> ( ( less @ ( pl @ x @ z ) @ ( pl @ x @ z ) )
=> ( ( pl @ x @ z )
!= ( pl @ x @ z ) ) ) ),
introduced(definition,[new_symbols(definition,[sP23])]) ).
thf(sP24,plain,
( sP24
<=> ( sP15
=> ( ( pl @ x @ z )
= ( pl @ y @ z ) ) ) ),
introduced(definition,[new_symbols(definition,[sP24])]) ).
thf(sP25,plain,
( sP25
<=> ! [X1: nat] :
( ( ( pl @ x @ z )
= X1 )
=> ( X1
= ( pl @ x @ z ) ) ) ),
introduced(definition,[new_symbols(definition,[sP25])]) ).
thf(sP26,plain,
( sP26
<=> ! [X1: nat,X2: nat] :
( ( X1 = X2 )
=> ( X2 = X1 ) ) ),
introduced(definition,[new_symbols(definition,[sP26])]) ).
thf(sP27,plain,
( sP27
<=> ( ( ( ( pl @ x @ z )
= ( pl @ x @ z ) )
=> ~ ( more @ ( pl @ x @ z ) @ ( pl @ x @ z ) ) )
=> sP6 ) ),
introduced(definition,[new_symbols(definition,[sP27])]) ).
thf(sP28,plain,
( sP28
<=> ( ( pl @ x @ z )
= ( pl @ y @ z ) ) ),
introduced(definition,[new_symbols(definition,[sP28])]) ).
thf(sP29,plain,
( sP29
<=> ( ( pl @ x @ z )
= ( pl @ x @ z ) ) ),
introduced(definition,[new_symbols(definition,[sP29])]) ).
thf(sP30,plain,
( sP30
<=> ! [X1: nat,X2: nat,X3: nat] :
( ( more @ X1 @ X2 )
=> ( more @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X3 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP30])]) ).
thf(sP31,plain,
( sP31
<=> ( less @ ( pl @ x @ z ) @ ( pl @ x @ z ) ) ),
introduced(definition,[new_symbols(definition,[sP31])]) ).
thf(sP32,plain,
( sP32
<=> ! [X1: nat] :
( sP15
=> ( ( pl @ x @ X1 )
= ( pl @ y @ X1 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP32])]) ).
thf(satz20c,conjecture,
sP19 ).
thf(h0,negated_conjecture,
~ sP19,
inference(assume_negation,[status(cth)],[satz20c]) ).
thf(1,plain,
( ~ sP9
| ~ sP12
| ~ sP2 ),
inference(prop_rule,[status(thm)],]) ).
thf(2,plain,
( ~ sP16
| sP20 ),
inference(all_rule,[status(thm)],]) ).
thf(3,plain,
( ~ sP20
| ~ sP21
| sP12 ),
inference(prop_rule,[status(thm)],]) ).
thf(4,plain,
( ~ sP10
| ~ sP28
| sP4 ),
inference(prop_rule,[status(thm)],]) ).
thf(5,plain,
( ~ sP25
| sP10 ),
inference(all_rule,[status(thm)],]) ).
thf(6,plain,
( ~ sP32
| sP24 ),
inference(all_rule,[status(thm)],]) ).
thf(7,plain,
( ~ sP24
| ~ sP15
| sP28 ),
inference(prop_rule,[status(thm)],]) ).
thf(8,plain,
( sP13
| sP9 ),
inference(prop_rule,[status(thm)],]) ).
thf(9,plain,
( sP11
| ~ sP13 ),
inference(prop_rule,[status(thm)],]) ).
thf(10,plain,
( ~ sP8
| sP16 ),
inference(all_rule,[status(thm)],]) ).
thf(11,plain,
( ~ sP7
| sP32 ),
inference(all_rule,[status(thm)],]) ).
thf(12,plain,
( ~ sP14
| ~ sP11 ),
inference(all_rule,[status(thm)],]) ).
thf(13,plain,
( ~ sP2
| sP31
| ~ sP29
| ~ sP4 ),
inference(mating_rule,[status(thm)],]) ).
thf(14,plain,
( ~ sP23
| ~ sP31
| ~ sP29 ),
inference(prop_rule,[status(thm)],]) ).
thf(15,plain,
( sP6
| sP23 ),
inference(prop_rule,[status(thm)],]) ).
thf(16,plain,
( sP27
| ~ sP6 ),
inference(prop_rule,[status(thm)],]) ).
thf(17,plain,
sP29,
inference(prop_rule,[status(thm)],]) ).
thf(18,plain,
( ~ sP14
| ~ sP27 ),
inference(all_rule,[status(thm)],]) ).
thf(19,plain,
( ~ sP18
| sP7 ),
inference(all_rule,[status(thm)],]) ).
thf(20,plain,
( ~ sP30
| sP8 ),
inference(all_rule,[status(thm)],]) ).
thf(21,plain,
( ~ sP5
| sP14 ),
inference(all_rule,[status(thm)],]) ).
thf(22,plain,
( ~ sP26
| sP25 ),
inference(all_rule,[status(thm)],]) ).
thf(23,plain,
sP26,
inference(eq_sym,[status(thm)],]) ).
thf(24,plain,
( ~ sP1
| sP22 ),
inference(all_rule,[status(thm)],]) ).
thf(25,plain,
( ~ sP22
| sP17 ),
inference(all_rule,[status(thm)],]) ).
thf(26,plain,
( ~ sP17
| sP15
| sP3 ),
inference(prop_rule,[status(thm)],]) ).
thf(27,plain,
( ~ sP3
| sP21
| sP19 ),
inference(prop_rule,[status(thm)],]) ).
thf(l,axiom,
sP2 ).
thf(satz10b,axiom,
sP5 ).
thf(satz19a,axiom,
sP30 ).
thf(satz19b,axiom,
sP18 ).
thf(satz10a,axiom,
sP1 ).
thf(28,plain,
$false,
inference(prop_unsat,[status(thm),assumptions([h0])],[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,l,satz10b,satz19a,satz19b,satz10a,h0]) ).
thf(0,theorem,
sP19,
inference(contra,[status(thm),contra(discharge,[h0])],[28,h0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : NUM682^1 : TPTP v8.1.0. Released v3.7.0.
% 0.12/0.13 % Command : satallax -E eprover-ho -P picomus -M modes -p tstp -t %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jul 7 17:00:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51 % SZS status Theorem
% 0.20/0.51 % Mode: mode213
% 0.20/0.51 % Inferences: 1178
% 0.20/0.51 % SZS output start Proof
% See solution above
%------------------------------------------------------------------------------